NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
411	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Maximum-Weight Planar Boxes in O(n2 ) Time (and Better) J´er´emy Barbay∗ Timothy M. Chan† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 NP-complete problems Algorithm Mathematical logic Computational geometry Numerical software PROPT Mathematics Applied mathematics Theoretical computer science
412	Curriculum Vitae Stephen G. Kobourov Department of Computer Science University of Arizona, Tucson AZWeb: http://www.cs.arizona.edu/˜kobourov Email: Add to Reading List Source URL: www.cs.arizona.edu Language: English - Date: 2015-04-13 15:56:42 Topological graph theory Graph drawing NP-complete problems Geometric graph theory Graph embedding Planar graph Graph coloring Force-based algorithms Graph Graph theory Mathematics Theoretical computer science
413	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
414	Kodkod for Alloy Users Emina Torlak and Greg Dennis Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory Cambridge, MA 02139 {emina, Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:26:58 NP-complete problems Alloy Analyzer Massachusetts Institute of Technology Recreational mathematics Alloy N1 road N postcode area Sudoku Boolean satisfiability problem Theoretical computer science Mathematics Formal methods
415	LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:25:39 Analysis of algorithms Complexity classes Parameterized complexity Kernelization NP-complete problems Time complexity PP Polynomial NP Theoretical computer science Computational complexity theory Applied mathematics
416	Managing Large Graphs on Multi-Cores With Graph Awareness Vijayan Prabhakaran, Ming Wu, Xuetian Weng Frank McSherry, Lidong Zhou, Maya Haridasan†∗∗ Microsoft Research, †Google Abstract Add to Reading List Source URL: www.usenix.org Language: English - Date: 2015-05-31 08:44:11 Graph Connected component Vertex Connectivity Graph coloring Planar separator theorem Heawood graph Graph theory NP-complete problems Line graph
417	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory
418	CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:15 NP-complete problems Algorithm Set cover problem Polynomial Vertex cover Matroid Mathematics Hypergraph Applied mathematics
419	Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:04:12 NP-complete problems Parameterized complexity Kernelization Path decomposition Clique Tree decomposition Vertex cover Dominating set Edge coloring Graph theory Theoretical computer science Mathematics
420	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics

UPDATE